1![The Complexity of Safety Stock Placement in General-Network Supply Chains Ekaterina Lesnaia, Iuliu Vasilescu, and Stephen C. Graves MIT Abstract— We consider the optimization problem of safety The Complexity of Safety Stock Placement in General-Network Supply Chains Ekaterina Lesnaia, Iuliu Vasilescu, and Stephen C. Graves MIT Abstract— We consider the optimization problem of safety](https://www.pdfsearch.io/img/813405a6e1e056ff28e2ef3b44ee4095.jpg) | Add to Reading ListSource URL: web.mit.eduLanguage: English - Date: 2016-06-07 13:49:55
|
---|
2![Deadline-Aware Multipath Communication: An Optimization Problem Laurent Chuat∗ , Adrian Perrig∗ , Yih-Chun Hu† of Computer Science, ETH Zurich, Switzerland † Department of Electrical and Computer Engineering, Uni Deadline-Aware Multipath Communication: An Optimization Problem Laurent Chuat∗ , Adrian Perrig∗ , Yih-Chun Hu† of Computer Science, ETH Zurich, Switzerland † Department of Electrical and Computer Engineering, Uni](https://www.pdfsearch.io/img/bb5f29102dec222012e8ce53a964177a.jpg) | Add to Reading ListSource URL: www.netsec.ethz.chLanguage: English |
---|
3![Combined Optimization and Reinforcement Learning for Manipulation Skills Peter Englert and Marc Toussaint Machine Learning & Robotics Lab University of Stuttgart, Germany Abstract—This work addresses the problem of how Combined Optimization and Reinforcement Learning for Manipulation Skills Peter Englert and Marc Toussaint Machine Learning & Robotics Lab University of Stuttgart, Germany Abstract—This work addresses the problem of how](https://www.pdfsearch.io/img/2bd09bb599acd16cab82b1defbdf2ae6.jpg) | Add to Reading ListSource URL: ipvs.informatik.uni-stuttgart.deLanguage: English - Date: 2017-10-30 12:23:26
|
---|
4![The Quadratic Assignment Problem in Code Optimization for a Simple Universal Turing Machine The Quadratic Assignment Problem in Code Optimization for a Simple Universal Turing Machine](https://www.pdfsearch.io/img/9e7d4aacb95baa08a45861ec503deef0.jpg) | Add to Reading ListSource URL: wpmedia.wolfram.comLanguage: English - Date: 2018-03-14 11:53:24
|
---|
5![Formulating an Optimization Problem Formulating an Optimization Problem](https://www.pdfsearch.io/img/8ef1d14b49d4b0d2be4a5e17c0e094b3.jpg) | Add to Reading ListSource URL: www.macc.mcmaster.caLanguage: English - Date: 2011-12-04 17:45:44
|
---|
6![SUMS OF SQUARES, MOMENT MATRICES AND OPTIMIZATION OVER POLYNOMIALS MONIQUE LAURENT∗ Updated version: February 6, 2010 Abstract. We consider the problem of minimizing a polynomial over a semialgebraic set defined by pol SUMS OF SQUARES, MOMENT MATRICES AND OPTIMIZATION OVER POLYNOMIALS MONIQUE LAURENT∗ Updated version: February 6, 2010 Abstract. We consider the problem of minimizing a polynomial over a semialgebraic set defined by pol](https://www.pdfsearch.io/img/f90a14faab5eb823b647a9478e8053e5.jpg) | Add to Reading ListSource URL: homepages.cwi.nlLanguage: English - Date: 2010-02-06 15:22:54
|
---|
7![The Price of Differential Privacy for Online Learning Naman Agarwal 1 Karan Singh 1 Abstract We design differentially private algorithms for the problem of online linear optimization in the The Price of Differential Privacy for Online Learning Naman Agarwal 1 Karan Singh 1 Abstract We design differentially private algorithms for the problem of online linear optimization in the](https://www.pdfsearch.io/img/8023f4f6fdc552cf23551a5fba773d4a.jpg) | Add to Reading ListSource URL: proceedings.mlr.pressLanguage: English - Date: 2018-02-06 15:06:57
|
---|
8![Distributed Bregman-Distance Algorithms for Min-Max Optimization Kunal Srivastava, Angelia Nedi´c and Duˇsan Stipanovi´c Abstract We consider a min-max optimization problem over a time-varying network of computational Distributed Bregman-Distance Algorithms for Min-Max Optimization Kunal Srivastava, Angelia Nedi´c and Duˇsan Stipanovi´c Abstract We consider a min-max optimization problem over a time-varying network of computational](https://www.pdfsearch.io/img/e3dc9aa4e4c61366c4c569f0151ddd8a.jpg) | Add to Reading ListSource URL: www.ifp.illinois.eduLanguage: English - Date: 2012-07-08 16:00:18
|
---|
9![Generalized Line Spectral Estimation via Convex Optimization Reinhard Heckel∗ and Mahdi Soltanolkotabi† September 26, 2016 Abstract Line spectral estimation is the problem of recovering the frequencies and amplitudes Generalized Line Spectral Estimation via Convex Optimization Reinhard Heckel∗ and Mahdi Soltanolkotabi† September 26, 2016 Abstract Line spectral estimation is the problem of recovering the frequencies and amplitudes](https://www.pdfsearch.io/img/39e38ca9f69d620b1d52c4d8f1c08c66.jpg) | Add to Reading ListSource URL: www.reinhardheckel.com- Date: 2018-02-26 16:53:33
|
---|
10![Identifying and attacking the saddle point problem in high-dimensional non-convex optimization Razvan Pascanu Universit´e de Montr´eal Identifying and attacking the saddle point problem in high-dimensional non-convex optimization Razvan Pascanu Universit´e de Montr´eal](https://www.pdfsearch.io/img/0dc744d476c425fb2adb7f593b886dc8.jpg) | Add to Reading ListSource URL: arxiv.org- Date: 2014-06-10 20:21:26
|
---|